A3-Codes under Collusion Attacks
نویسندگان
چکیده
An A-code is an extension of A-code in which none of the three participants, transmitter, receiver and arbiter, is assumed trusted. In this paper we extend the previous model of A-codes by allowing transmitter and receiver not only to individually attack the system but also collude with the arbiter against the other. We derive informationtheoretic lower bounds on success probability of various attacks, and combinatorial lower bounds on the size of key spaces. We also study combinatorial structure of optimal A-code against collusion attacks and give a construction of an optimal code.
منابع مشابه
Analysis of Boneh-Shaw Finger Printing Codes under Majority Value Collusion Attacks
Lot of research has been done in the previous years to deal with threat of collusion attacks on finger printing codes. Digital fingerprints are code inserted in the media contents before distribution. Each fingerprinting code is assigned to an intended recipient. This fingerprinting code is used to track the culprit in case of illegal distribution of media contents by users. It is now possible ...
متن کاملCapacity and optimal collusion attack channels for Gaussian fingerprinting games
In content fingerprinting, the same media covertext—image, video, audio, or text—is distributed to many users. A fingerprint, a mark unique to each user, is embedded into each copy of the distributed covertext. In a collusion attack, two or more users may combine their copies in an attempt to “remove” their fingerprints and forge a pirated copy. To trace the forgery back to members of the coali...
متن کاملGroup-oriented and Collusion Secure Fingerprint for Digital Images
Digital fingerprinting is a technique for identifying unauthorized copy and tracing back to its user. The distributor marks each individual copy with a unique fingerprint. The present fingerprinting schemes generally have many difficulties and disadvantages in the case of large-size users. In this paper, we present a new fingerprint scheme which can be used in confidential departments where the...
متن کاملMaking Collusion-Secure Codes (More) Robust against Bit Erasure
A collusion-secure code is called robust if it is secure against erasure of a limited number of undetectable bits, in addition to collusion attacks under Marking Assumption. In this article, we propose the first general conversion method of (non-robust) c-secure codes to robust c-secure codes. Also, the same method amplifies robustness of given robust c-secure codes. By applying our conversion ...
متن کاملPerformance of detection statistics under collusion attacks on independent multimedia fingerprints
Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Collusion attack is a cost effective attack against digital fingerprinting where several copies with the same content but different fingerprints are combined to remove the original fingerprints. In this paper, we consider average attack and several nonl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999